Algebraic modelling and performance evaluation of acyclic fork-join queueing networks
نویسنده
چکیده
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join queueing networks are derived using a (max,+)algebra based representation of network dynamics. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented. Key-Words: (max,+)-algebra, dynamic state equation, acyclic forkjoin queueing networks, stochastic dynamic systems, mean cycle time.
منابع مشابه
Monotonicity Properties and Simple Bounds on the Mean Cycle Time in Acyclic Fork-Join Queueing Networks
The (max,+ )-algebra approach is applied to establish some monotonicity properties and to get algebraic bounds on the service cycle completion times in acyclic fork-join queueing networks. The obtained results are extended to derive simple lower and upper bounds on the mean cycle time in stochastic networks.
متن کاملProducts of random matrices and queueing system performance evaluation
We consider (max,+)-algebra products of random matrices, which arise from performance evaluation of acyclic fork-join queueing networks. A new algebraic technique to examine properties of the product and investigate its limiting behaviour is proposed based on an extension of the standard matrix (max,+)-algebra by endowing it with the ordinary matrix addition as an external operation. As an appl...
متن کاملQueueing systems and networks . Models and applications
This article describes queueing systems and queueing networks which are successfully used for performance analysis of different systems such as computer, communications, transportation networks and manufacturing. It incorporates classical Markovian systems with exponential service times and a Poisson arrival process, and queueing systems with individual service. Oscillating queueing systems and...
متن کاملBounds on mean cycle time in acyclic fork-join queueing networks
Simple lower and upper bounds on mean cycle time in stochastic acyclic fork-join networks are derived using the (max,+)-algebra approach. The behaviour of the bounds under various assumptions concerning the service times in the networks is discussed, and related numerical examples are presented.
متن کاملModeling and performance evaluation of computer systems security operation
A model of computer system security operation is developed based on the fork-join queueing network formalism. We introduce a security operation performance measure, and show how it may be used to performance evaluation of actual systems. Key-Words: computer system security, security attack, security vulnerability, performance evaluation, fork-join queueing networks.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1212.4648 شماره
صفحات -
تاریخ انتشار 2002